Distributed wireless link scheduling in the SINR model

We present an approximation algorithm for wireless link scheduling under the physical SINR interference model. In the link scheduling problem, it is given a set of n links in a metric space, each of which is a sender–receiver pair, and the objective is to schedule the links using the minimum amount of time. We focus on a variant of this fundamental problem where the power is fixed, i.e., the power assignment of links is given as part of the input. Specifically, we consider an important category of power assignments called length-monotone sublinear power assignment, which includes the widely studied uniform, mean and linear power assignments. We present a distributed B Yuexuan Wang [email protected] Dongxiao Yu [email protected] Qiangsheng Hua [email protected] Jiguo Yu [email protected] Francis C. M. Lau [email protected] 1 Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, People’s Republic of China 2 College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, People’s Republic of China 3 Services Computing Technology and System Lab/Cluster and Grid Computing Lab, School of Computer Science & Technology, Huazhong University of Science and Technology, Wuhan 430074, People’s Republic of China 4 School of Information Science and Engineering, Qufu Normal University, Rizhao 276800, People’s Republic of China